Emptiness Problems of eNCE Graph Languages
نویسندگان
چکیده
We consider the complexity of the emptiness problem for various classes of graph languages deened by eNCE (edge label neighborhood controlled embedding) graph grammars. In particular, we show that the emptiness problem is undecidable for general eNCE graph grammars, DEXPTIME-complete for connuent and boundary eNCE graph grammars, PSPACE-complete for linear eNCE graph grammars, NL-complete for deterministic connuent, deterministic boundary, and deterministic linear eNCE graph grammars. The exponential time algorithm for deciding emptiness of connuent eNCE graph grammars is based on an exponential time transformation of a connuent eNCE graph grammar into a nonblocking connuent eNCE graph grammar generating the same language.
منابع مشابه
Separating k-Separated eNCE Graph Languages
Kim, C. and D.H. Lee, Separating k-separated eNCE graph languages, Theoretical Computer Science 120 (1993) 247-259. An eNCE graph grammar is k-separated (k > 1) if the distance between any two nonterminal nodes in any of its sentential forms is at least k. Let SEP, denote the class of graph languages generated by SEPl (SEP2) is the class of eNCE (boundar E) graph languages, Recently, Engelfriet...
متن کاملP-hardness of the emptiness problem for visibly pushdown languages
Visibly pushdown languages form a subclass of the context-free languages which is appealing because of its nice algorithmic and closure properties. Here we show that the emptiness problem for this class is not any easier than the emptiness problem for context-free languages, namely hard for deterministic polynomial time. The proof consists of a reduction from the alternating graph reachability ...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملIntersection Non-Emptiness for Tree Shaped Finite Automata
In recent work on the Clique problem by Chen, Huang, Kanj, and Xia (2006) it was shown that if k-Clique is solvable in no(k) time, then the exponential time hypothesis is false. In this work, we focus on a related parameterized problem called intersection non-emptiness. We show that if intersection non-emptiness for two tree shaped DFA’s is solvable in O(n2− ) time, then the strong exponential ...
متن کاملHRNCE Grammars - A Hypergraph Generating System with an eNCE Way
Software Integration Problems and Coupling of Graph Grammar Specifications p. 155 Using Attributed Flow Graph Parsing to Recognize Cliches in Programs p. 170 Reconfiguration Graph Grammar for Massively Parallel, Fault Tolerant Computers p. 185 The Use of Tree Transducers to Compute Translations Between Graph Algebras p. 196 The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars p. 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 51 شماره
صفحات -
تاریخ انتشار 1995